Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("RECOUVREMENT ENSEMBLE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 526

  • Page / 22
Export

Selection :

  • and

RECOUVREMENTS MINIMAUX D'UN ENSEMBLE FINI. ISHIROKOV FV; SIGNAEVSKIJ VA.1972; DISKRETN. ANAL.; S.S.S.R.; DA. 1972; VOL. 21; PP. 72-94; BIBL. 2 REF.Serial Issue

ON PROJECTIVE AND AFFINE HYPERPLANESTEIRLINCK L.1980; J. COMBINATOR. THEORY; USA; DA. 1980; VOL. 28; NO 3; PP. 290-306; BIBL. 20 REF.Article

INTERNAL COVERINGS OF SETS BY ASYMMETRIC RELATIONSFISHBURN PC.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 3; PP. 195-202; BIBL. 6 REF.Serial Issue

ON THE SET-COVERING PROBLEMBALAS E; PADBERG MW.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 6; PP. 1152-1161; BIBL. 1 P.Serial Issue

IMPROVED BOUNDS FOR THE DISK-PACKING CONSTANTBOYD DW.1973; AEQUATIONES MATH.; SUISSE; DA. 1973; VOL. 9; NO 1; PP. 99-106; BIBL. 7 REF.Serial Issue

ON THE COVERING OF PAIRS BY QUADRUPLES. II.MILLS WH.1973; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1973; VOL. 15; NO 2; PP. 138-166; BIBL. 8 REF.Article

AN ALGORITHM FOR GENERATING THE SPHERE COORDINATES IN A THREE-DIMENSIONAL OSCULATORY PACKINGBOYD DW.1973; MATH. OF COMPUT.; U.S.A.; DA. 1973; VOL. 27; NO 122; PP. 369-377; BIBL. 6 REF.Serial Issue

COVERINGS OF CERTAIN FINITE GEOMETRIESRONAN MA.1981; LECT. NOTE SER.-LONDON MATH. SOC.; ISSN 0076-0552; GBR; DA. 1981; NO 49; PP. 316-331; BIBL. 13 REF.Conference Paper

ON A COVERING PROBLEM OF MULLIN AND STANTON FOR BINARY MATROIDSOXLEY JG.1980; AEQUATIONES MATH.; CHE; DA. 1980; VOL. 20; NO 1; PP. 104-112; BIBL. 12 REF.Article

THE REALIZATION OF DISTANCES IN MEASURABLE SUBSETS COVERING RNFALCONER KJ.1981; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1981; VOL. 31; NO 2; PP. 184-189; BIBL. 6 REF.Article

CATCHING SMALL SETS UNDER FLOWSELLIS MH; STEELE JM.1979; ANN. INST. HENRI POINCARE, B; FRA; DA. 1979; VOL. 15; NO 1; PP. 33-40; ABS. FRE; BIBL. 7 REF.Article

RECOUVREMENTS D'UN ENSEMBLE PAR UNE SOUS-FAMILLE DE SES PARTIES (SET-COVERING PROBLEM).LAVALLEE I.1974; AO-CNRS-10368; FR.; DA. 1974; PP. 1-110; BIBL. 3 P. 1/2; (THESE DOCT.-ING. MATH.; PARIS VI)Thesis

A LIMIT THEOREM FOR RANDOM COVERINGS OF A CIRCLE WHICH DO NOT QUITE COVERKAPLAN N.1978; J. APPL. PROBABIL.; GBR; DA. 1978; VOL. 15; NO 2; PP. 443-446; BIBL. 2 REF.Article

OPERATIONS COMBINATOIRES AVEC DES ENSEMBLES FINISDELYUKIN GV.1974; ELEKTRON. I MODELIROVAN., U.S.S.R.; S.S.S.R.; DA. 1974; NO 1; PP. 28-29Article

PERFORATION DES FACES D'UN CUBE-UNITE A N DIMENSIONSKOSTOCHKA EA.1976; DISKRETN. ANAL.; S.S.S.R.; DA. 1976; NO 28; PP. 55-64; BIBL. 1 REF.Article

SUBPROCESSES OF STATIONARY MARKOV PROCESSESTAKSAR MI.1981; Z. WAHRSCHEINLICHKEITSTHEOR. VERW. GEB.; ISSN 0044-3719; DEU; DA. 1981; VOL. 55; NO 3; PP. 275-296; BIBL. 4 REF.Article

GRAPHENALGORITHMEN UND UEBERDECKUNGSPROBLEME. = ALGORITHMES DE GRAPHES ET PROBLEMES DE RECOUVREMENTPERL J.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 13; NO 2; PP. 107-113; ABS. ANGL.; BIBL. 7 REF.Article

THE SET-COVERING PROBLEM WITH EQUALITY CONSTRAINTSGUHA DK.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 348-351; BIBL. 3 REF.Serial Issue

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

USING THE SETCOVERING PROBLEM TO ASSIGN FIRE COMPANIES TO FIRE HOUSES.WALKER W.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 2; PP. 275-277; BIBL. 3 REF.Article

A TECHNIQUE FOR THE SOLUTION OF MASSIVE SET COVERING PROBLEMS, WITH APPLICATION TO AIRLINE CREW SCHEDULING.RUBIN J.1973; TRANSPORT. SCI.; U.S.A.; DA. 1973; VOL. 7; NO 1; PP. 34-48; BIBL. 11 REF.Article

SUR LA SEMI-ADDITIVITE DES PLANS OPTIMAUX POUR LES PROBLEMES DE TRANSPORTSHVARTIN SM.1982; BANACH CENT. PUBL.; ISSN 0137-6934; POL; DA. 1982; VOL. 7; PP. 217-224; BIBL. 2 REF.Article

GAUSSIAN MEASURED AND COVERING THEOREMSPREISS D.1979; COMMENT. MATH. UNIV. CAROLINAE; CSK; DA. 1979; VOL. 20; NO 1; PP. 95-99; BIBL. 7 REF.Article

ON THE SET-COVERING PROBLEM. II. AN ALGORITHM FOR SET PARTITIONING.BALAS E; PADBERG M.1975; OPER. RES.; U.S.A.; DA. 1975; VOL. 23; NO 1; PP. 74-90; BIBL. 12 REF.Article

LE PROBLEME DE PARTITION SOUS CONTRAINTE.FREHEL J.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 269-274; BIBL. 5 REF.Conference Paper

  • Page / 22